A Short Proof of an Interesting Helly-Type Theorem

نویسنده

  • Nina Amenta
چکیده

We give a short proof of the theorem that any family of subsets of R with the property that the intersection of any non empty nite subfamily can be represented as the disjoint union of at most k closed convex sets has Helly number at most k d

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tolerance in Helly-Type Theorems

In this paper we introduce the notion of tolerance in connection with Helly type theorems and prove, using the Erdős-Gallai theorem, that any Helly type theorem can be generalized by relaxing the assumptions and conclusion, allowing a bounded number of exceptional sets or points. In particular, we analyze some of the classical Helly type theorems, such as Caratheodory’s and Tverberg’s theorems,...

متن کامل

A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS

In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.

متن کامل

Groups with one conjugacy class of non-normal subgroups‎ - ‎a short proof

For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.

متن کامل

Common xed point theorem for w-distance with new integral type contraction

Boujari [5] proved a fixed point theorem with an old version of the integraltype contraction , his proof is incorrect. In this paper, a new generalizationof integral type contraction is introduced. Moreover, a fixed point theorem isobtained.

متن کامل

A Simple Proof of the Sion Minimax Theorem

For convex subsets X of a topological vector space E, we show that a KKM principle implies a Fan-Browder type fixed point theorem and that this theorem implies generalized forms of the Sion minimax theorem. The von Neumann-Sion minimax theorem is fundamental in convex analysis and in game theory. von Neumann [8] proved his theorem for simplexes by reducing the problem to the 1-dimensional cases...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1996